package 剑指Offer1;

import java.util.LinkedList;
import java.util.List;

public class _01用两个栈实现队列 {
    class CQueue {

        private LinkedList<Integer> queue;
        public CQueue() {
            queue = new LinkedList<>();
        }

        public void appendTail(int value) {
            queue.addLast(value);
        }

        public int deleteHead() {
           if(queue.isEmpty()) return -1;
           return queue.removeFirst();
        }

    }
}
